A Virtual Machine Architecture for Constraint Based Programming
نویسنده
چکیده
We present a Forth style virtual machine architecture designed to provide for constriant based programming. We add ?CONTINUE and CHOICE commands to allow for checking constraints and making tentative choice. A choice which is later seen to be incompatible with a constraint provokes backtracking, which is implemented by reversible execution of the virtual machine. keywords: Forth, Virtual Machines, Constraint Based Programming, Reversible Computation.
منابع مشابه
Distributed Constraint Reasoning (DCR’07)
Open-source platforms are very useful for development and experimentation in constraint programming. However, until recently, no such platform existed for distributed constraint programming. This paper presents DisChoco, a platform for distributed constraint programming. DisChoco is a Java library implemented using the Choco solver and simple agent communication infrastructure (SACI). DisChoco ...
متن کاملBabelsberg/JS - A Browser-Based Implementation of an Object Constraint Language
Constraints provide a useful technique for ensuring that desired properties hold in an application. As a result, they have been used in a wide range of applications, including graphical layout, simulation, scheduling, and problem-solving. We describe the design and implementation of an Object Constraint Programming language, an object-oriented language that cleanly integrates constraints with t...
متن کاملConstraint Programming-Based Virtual Machines Placement Algorithm in Datacenter
As underlying infrastructure of cloud computing platform, datacenter is seriously underutilized, however, its operating costs is high. In this paper, we implement virtual machines placement algorithm in CloudSim using constraint programming approach. We first formulate the problem of virtual machines placement in virtualized datacenters as a variant of multi-dimensions bin packing problem, and ...
متن کاملAn Efficient Bi-objective Genetic Algorithm for the Single Batch-Processing Machine Scheduling Problem with Sequence Dependent Family Setup Time and Non-identical Job Sizes
This paper considers the problem of minimizing make-span and maximum tardiness simultaneously for scheduling jobs under non-identical job sizes, dynamic job arrivals, incompatible job families,and sequence-dependentfamily setup time on the single batch- processor, where split size of jobs is allowed between batches. At first, a new Mixed Integer Linear Programming (MILP) model is proposed for t...
متن کاملAgent-based approach for cooperative scheduling
This paper studies the multi-factory production (MFP) network scheduling problem where a number of different individual factories join together to form a MFP network, in which these factories can operate more economically than operating individually. However, in such network which known as virtual production network with self-interested factories with transportation times, each individual facto...
متن کامل